The Windy Postman Problem on Series-Parallel Graphs
نویسنده
چکیده
The windy postman problem is the NP-hard problem of finding the minimum cost of a tour traversing all edges of an undirected graph, where the cost of traversal of an edge depends on the direction. Given an undirected graph G, we consider the polyhedron O(G) induced by the linear programming relaxation of a well-known integer programming formulation of the problem. We say that G is windy postman perfect if O(G) is integral. There exists a polynomialtime algorithm, based on the ellipsoid method, to solve the windy postman problem for the class of windy postman perfect graphs. Eulerian graphs and trees are windy postman perfect. By considering a family of polyhedra related to O(G), we prove that series-parallel graphs are windy postman perfect, therefore solving a conjecture of Win (1987).
منابع مشابه
OAR Lib: An Open Source Arc Routing Library
We provide a flexible graph architecture, and an implementation of solvers to some of the most ubiquitous problems in the field of Arc Routing, (The Chinese Postman Problem on undirected, directed, mixed, and windy graphs, as well as the Rural Postman Problem on directed and windy graphs). The project is completed in java, is open source, and is hosted at https://github.com/Olibear/ArcRoutingLi...
متن کاملCapacitated Windy Rural Postman Problem with Several Vehicles: A Hybrid Multi-Objective Simulated Annealing Algorithm
This paper presents the capacitated Windy Rural Postman Problem with several vehicles. For this problem, two objectives are considered. One of them is the minimization of the total cost of all vehicle routes expressed by the sum of the total traversing cost and another one is reduction of the maximum cost of vehicle route in order to find a set of equitable tours for the vehicles. Mathematical ...
متن کاملNew results on the Windy Postman Problem
In this paper we study the Windy Postman Problem. This is a well known Arc Routing Problem which contains the Mixed Chinese Postman Problem as a special case. We present here a full description of the polyhedron associated to the Windy Postman Problem over graphs with up to 4 vertices and 10 edges. We introduce two new families of facet-inducing inequalities and we prove that these inequalities...
متن کاملA branch-price-and-cut method for the min-max k-windy rural postman problem
Given the edges of a graph, the postman problem consists of determining for a vehicle (postman) a shortest route that traverses all edges at least once. Each edge can be traversed in either direction and, when an edge is traversed more than once, the vehicle is said to be deadheading after its first traversal. The rural postman problem is the same as the postman problem except that the edges ar...
متن کاملNew heuristic algorithms for the windy rural postman problem
In this paper we deal with the Windy Rural Postman Problem. This problem generalizes several important Arc Routing Problems and has interesting real-life applications. Here, we present several heuristics whose study has lead to the design of a Scatter Search algorithm for the Windy Rural Postman Problem. Extensive computational experiments over different sets of instances, with sizes up to 988 ...
متن کامل